Strongly regular graphs from reducible cyclic codes
نویسندگان
چکیده
Let p be a prime number. Reducible cyclic codes of rank 2 over $$\mathbb {Z}_{p^m}$$ are shown to have exactly two Hamming weights in some cases. Their weight distribution is computed explicitly. When these projective, the coset graphs their dual strongly regular. The spectra determined.
منابع مشابه
Binary Codes of Strongly Regular Graphs
For strongly regular graphs with adjacency matrix A, we look at the binary codes generated by A and A+ I . We determine these codes for some families of graphs, we pay attention to the relation between the codes of switching equivalent graphs and, with the exception of two parameter sets, we generate by computer the codes of all known strongly regular graphs on fewer than 45 vertices.
متن کاملDirected Strongly Regular Graphs and Their Codes
Directed Strongly Regular Graphs (DSRG) were introduced by Duval as a generalization of strongly regular graphs (SRG’s) [4]. As observed in [8] a special case of these are the doubly regular tournaments or equivalently, the skew Hadamard matrices. As the latter already lead to many interesting codes [10] it is natural to consider the more general case of codes constructed from the adjacency mat...
متن کاملIdentifying Codes in Vertex-Transitive Graphs and Strongly Regular Graphs
We consider the problem of computing identifying codes of graphs and its fractional relaxation. The ratio between the size of optimal integer and fractional solutions is between 1 and 2 ln(|V |) + 1 where V is the set of vertices of the graph. We focus on vertex-transitive graphs for which we can compute the exact fractional solution. There are known examples of vertex-transitive graphs that re...
متن کاملRing geometries, two-weight codes, and strongly regular graphs
It is known that a linear two-weight code C over a finite field Fq corresponds both to a multiset in a projective space over Fq that meets every hyperplane in either a or b points for some integers a < b , and to a strongly regular graph whose vertices may be identified with the codewords of C . Here we extend this classical result to the case of a ring-linear code with exactly two nonzero homo...
متن کاملStrongly regular graphs
Strongly regular graphs form an important class of graphs which lie somewhere between the highly structured and the apparently random. This chapter gives an introduction to these graphs with pointers to more detailed surveys of particular topics.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Algebraic Combinatorics
سال: 2021
ISSN: ['0925-9899', '1572-9192']
DOI: https://doi.org/10.1007/s10801-020-01006-6